Robust Nonsmooth Interval-Valued Optimization Problems Involving Uncertainty Constraints

نویسندگان

چکیده

In this paper, Karush-Kuhn-Tucker type robust necessary optimality conditions for a nonsmooth interval-valued optimization problem (UCIVOP) are formulated using the concept of LU-optimal solution and generalized Slater constraint qualification (GRSCQ). These shown to be sufficient under convexity. The Wolfe Mond-Weir dual problems over cones convexity assumptions, usual duality results established. presented illustrated by non-trivial examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonsmooth interval-valued optimization and saddle-point optimality criteria

In this article, we focus our attention on a nonsmooth interval-valued optimization problem and establish sufficient optimality conditions for a feasible solution to be a LU optimal solution under the invexity assumption. Appropriate duality theorems for Wolfe and Mond-Weir type duals are presented in order to relate the LU optimal solution of primal and dual programs. Moreover, saddle-point ty...

متن کامل

Interval-Valued Optimization Problems Involving (α, ρ)-Right Upper-Dini-Derivative Functions

We consider an interval-valued multiobjective problem. Some necessary and sufficient optimality conditions for weak efficient solutions are established under new generalized convexities with the tool-right upper-Dini-derivative, which is an extension of directional derivative. Also some duality results are proved for Wolfe and Mond-Weir duals.

متن کامل

Nonconvex Robust Optimization for Problems with Constraints

W propose a new robust optimization method for problems with objective functions that may be computed via numerical simulations and incorporate constraints that need to be feasible under perturbations. The proposed method iteratively moves along descent directions for the robust problem with nonconvex constraints and terminates at a robust local minimum. We generalize the algorithm further to m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10111787